Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(x,x) |
→ f(g(x),x) |
| 2: |
|
g(x) |
→ s(x) |
|
There are 2 dependency pairs:
|
| 3: |
|
F(x,x) |
→ F(g(x),x) |
| 4: |
|
F(x,x) |
→ G(x) |
|
The approximated dependency graph contains one SCC:
{3}.
-
Consider the SCC {3}.
The usable rules are {2}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006